Preference-Based Group Scheduling
نویسندگان
چکیده
Traditional group scheduling applications often treat users' availability as binary: free or busy. This is an unrealistic representation because not all times are equally free or busy. The inflexibility makes it difficult to find times with which everyone is truly satisfied. We present an online group scheduling approach by which users indicate four-tier preferences for meeting times on a calendar, which dynamically adjusts to provide instant feedback and suggests optimal meeting times for all participants. Our prototype is geared toward college students and the scheduling is done through a democratic and open negotiation process where everyone's preference is heard. Students who evaluated the prototype thought that the scheduling process was more efficient than the widely-used e-mail scheduling among college students, which is largely based on binary availability.
منابع مشابه
A Nurse Scheduling Model under Real Life Constraints
Background and Objectives: In this paper, a real life nurse scheduling model is described based on the conditions in Iranian hospitals such as monthly shift rotation, consecutive morning and evening shifts and consecutive evening and night shift. Methods: The developed model considers both hospital constraints and nurses’ preferences. Hospital constraints include assigning adequate qualifie...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملA Quadratic Programming Method for Ranking Alternatives Based on Multiplicative and Fuzzy Preference Relations
This paper proposes a quadratic programming method (QPM) for ranking alternatives based on multiplicative preference relations (MPRs) and fuzzy preference relations (FPRs). The proposed QPM can be used for deriving a ranking from either a MPR or a FPR, or a group of MPRs, or a group of FPRs, or their mixtures. The proposed approach is tested and examined with two numerical examples, and compara...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملIntuitionistic Fuzzy Set Based Task Scheduling with QoS Preference Awareness
Existing task scheduling algorithms in cloud computing have lack the ability to be aware of users' quality of service (QoS) preference. In order to address this problem, "intuitionistic fuzzy analysis" is introduced to determine users' QoS preference. In addition, the "optimal sequence decision method" helps experts use their professional knowledge to decide the weights of QoS classes. Using th...
متن کامل